Heuristic solution of the multisource Weber problem as a p-median problem
نویسندگان
چکیده
Good heuristic solutions for large Multisource Weber problems can be obtained by solving related p median problems in which potential locations of the facilities are users locations and then solving Weber problems for the sets of users of each facility
منابع مشابه
Heuristic Solution of the MultisourceWeber Problem as a p - Median
Good heuristic solutions for large Multisource Weber problems can be obtained by solving related p-median problems in which potential locations of the facilities are users locations and then solving Weber problems for the sets of users of each facility. Weber's problem is to locate a facility in the Euclidean plane in order to minimize the sum of its (weighted) distances to the locations of a g...
متن کاملPERFORMANCE COMPARISON OF CBO AND ECBO FOR LOCATION FINDING PROBLEMS
The p-median problem is one of the discrete optimization problem in location theory which aims to satisfy total demand with minimum cost. A high-level algorithmic approach can be specialized to solve optimization problem. In recent years, meta-heuristic methods have been applied to support the solution of Combinatorial Optimization Problems (COP). Collision Bodies Optimization algorithm (CBO) a...
متن کاملAn Efficient Hybrid Metaheuristic for Capacitated p-Median Problem
Capacitated p-median problem (CPMP) is a well-known facility-location problem, in which p capacitated facility points are selected to satisfy n demand points in such a way that the total assigned demand to each facility does not exceed its capacity. Minimizing the total sum of distances between each demand point and its nearest facility point is the objective of the problem. Developing an effic...
متن کاملA Survey of Solution Methods for the Continuous Location-Allocation Problem
In this survey, we examine an important class of facility location problems known as the multisource Weber problem (also referred to as the continuous location-allocation problem). We also show how recent advances in the use of metaheuristic rules have significantly improved the ability to solve problems of this type. The new solution methods are discussed for both the well known multisource W...
متن کاملImprovements and Comparison of Heuristics for Solving the Multisource Weber Problem
The multisource Weber problem is to locate simultaneously m facilities in the Euclidean plane in order to minimize the total transportation cost for satisfying the demand of n xed users, each supplied from its closest facility. Many heuristics have been proposed for this problem, as well as a few exact algorithms. Heuristics are needed to solve quickly large problems and to provide good initial...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Oper. Res. Lett.
دوره 22 شماره
صفحات -
تاریخ انتشار 1998